Planning as Heuristic Search for Incremental Fault Diagnosis and Repair
نویسندگان
چکیده
In this paper we study the problem of incremental fault diagnosis and repair of mechatronic systems where the task is to choose actions such that the expected cost of repair is minimal. This is done by interleaving acting with the generation of partial conditional plans used to decide the next action. A diagnostic model based on Bayesian Networks is used to update the current belief state after each action. The planner uses a simplified version of this model to update predicted belief states. We have tested the approach in the domain of troubleshooting heavy vehicles. Experiments show that a simplified model for planning improves performance when troubleshooting with limited time.
منابع مشابه
Truncated Incremental Search: Faster Replanning by Exploiting Suboptimality
Incremental heuristic searches try to reuse their previous search efforts whenever these are available. As a result, they can often solve a sequence of similar planning problems much faster than planning from scratch. State-of-the-art incremental heuristic searches such as LPA*, D* and D* Lite all work by propagating cost changes to all the states on the search tree whose gvalues (the costs of ...
متن کاملCreating a Uniform Framework for Task and Motion Planning: A Case for Incremental Heuristic Search? [Overview Paper]
In this short overview paper, we describe our vision for combining task and motion planning and present a historical perspective to show which parts of it have already become reality. Robots do not have to plan only once but repeatedly. Replanning from scratch is often very time consuming. Incremental heuristic search addresses this issue by reusing information from previous searches to find so...
متن کاملAn Incremental Search Approach to Real-Time Planning: Preliminary Results for a Scheduling Problem
We propose an incremental search method for making planning decisions in real time. As an example, we present the problem of scheduling jobs in a factory as a real-time decision problem, and model the real-time constraints as strict limits on the amount of computation that can be performed before a scheduling decision must be made. Our approach is to use incremental heuristic search techniques ...
متن کاملIncremental Heuristic Search in Games: The Quest for Speed
Robot path-planning methods can be used in real-time computer games but then need to run fast to ensure that the game characters move in real time, an issue addressed by incremental heuristic search methods. In this paper, we demonstrate how one can speed up D* Lite, an incremental heuristic search method that implements planning with the freespace assumption to move game characters in initiall...
متن کاملLifelong Planning A
Heuristic search methods promise to find shortest paths for path-planning problems faster than uninformed search methods. Incremental search methods, on the other hand, promise to find shortest paths for series of similar path-planning problems faster than is possible by solving each path-planning problem from scratch. In this article, we develop Lifelong Planning A* (LPA*), an incremental vers...
متن کامل